Approximations and Fast Algorithms
نویسنده
چکیده
The key element in the design of fast algorithms in numerical analysis and signal processing is the selection of an eÆcient approximation for the functions and operators involved. In this talk we will consider approximations using wavelet and multiwavelet bases as well as a new type of approximation for bandlimited functions using exponentials obtained via Generalized Gaussian quadratures. Analytically, the latter approximation corresponds to using the basis of the Prolate Spheroidal Wave functions. We will brie y comment on the future development of approximation techniques and the corresponding fast algorithms.
منابع مشابه
Evaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms
Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...
متن کاملSubspace Iteration Randomization and Singular Value Problems
A classical problem in matrix computations is the efficient and reliable approximation of a given matrix by a matrix of lower rank. The truncated singular value decomposition (SVD) is known to provide the best such approximation for any given fixed rank. However, the SVD is also known to be very costly to compute. Among the different approaches in the literature for computing low-rank approxima...
متن کاملApproximation Theory and the Design of Fast Algorithms
We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e−x,1/x, and xk. We then present a selection of results demonstrating how such approximations can be used to speed up primitives crucial for the design of fast algorithms for problems such as simulating random walks, graph partitioning, solving linear system of equat...
متن کاملTwo Methods for Estimating Overcomplete Independent Component Bases
Estimating overcomplete ICA bases is a difficult problem that emerges when using ICA on many kinds of natural data, e.g. image data. Most algorithms are based on approximations of the likelihood, which leads to computationally heavy procedures. Here we introduce two algorithms that are based on heuristic approximations and estimate an approximate overcomplete basis quite fast. The algorithms ar...
متن کاملStrong Steiner Tree Approximations in Practice
In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio less than 2. The considered greedy algorithms and approaches based on linear programming involve the incorporation of k-restricted full components for some k ≥ 3. For most of the algorithms, their strongest theoretical approximation bounds are only achieved for k →∞. However, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003